MPTCP Is Not Pareto-Optimal: Performance Issues and a Possible Solution
نویسندگان
چکیده
منابع مشابه
Non-Pareto Optimality of MPTCP: Performance Issues and a Possible Solution
MPTCP has been proposed as a mechanism to support transparently multiple connections to the application layer and is under discussion at the IETF [1]. It can effectively use the available bandwidth and it improves throughput and fairness, compared to independent TCP flows in many scenarios [2–4]. However we show, by measurements over our testbed and analytically, that MPTCP still suffers from t...
متن کاملApproximating the Pareto Set: Concepts, Diversity Issues, and Performance Assessment
This paper adresses the problem of diversity in multiobjective evolutionary algorithms and its implications for the quality of the approximated set of efficient solutions (Pareto set). Current approaches for maintaining diversity are classified and related to the overall fitness assignment strategy. The resulting groups of complex selection operators are presented and tested on different object...
متن کاملPareto Optimal Solution Analysis of Convex Multi-Objective Programming Problem
The main method of solving multi-objective programming is changing multi-objective programming problem into single objective programming problem, and then get Pareto optimal solution. Conversely, whether all Pareto optimal solutions can be obtained through appropriate method, generally the answer is negative. In this paper, the methods of norm ideal point and membership function are used to sol...
متن کاملUsing Soft CSPs for Approximating Pareto-Optimal Solution Sets
We consider constraint satisfaction problems where solutions must be optimized according to multiple criteria. When the relative importance of different criteria cannot be quantified, there is no single optimal solution, but a possibly very large set of Pareto-optimal solutions. Computing this set completely is in general very costly and often infeasible in practical applications. We consider s...
متن کاملInterpolation of the Pareto Optimal Solution in Multiobjective Genetic Algorithms
Proposal in this paper is a method of interpolating the pareto optimal solution in Multiobjective Genetic Algorithms. In this method, some vacancies are maked up by resuming computation of Multiobjective Genetic Algorithms. A beginning field is set up by variables of both sides of the vacancy. Then, computation of Multiobjective Genetic Algorithms is started from the beginning field again. Visu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2013
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2013.2274462